Demand-wise Shared Protection revisited: A new model for survivable network design∗

نویسندگان

  • R. Wessäly
  • S. Orlowski
  • A. Zymolka
  • A. Koster
  • C. Gruber
چکیده

In this article, a new integer linear programming model for the end-to-end survivability concept Demand-wise Shared Protection (dsp) is presented. dsp is based on the idea that backup capacity is dedicated to a particular demand, but shared within a demand. It combines advantages of dedicated and shared protection: It is more cost-efficient than dedicated protection and operationally easier than shared protection. In a previous model for dsp, the number of working and backup paths to be configured for a particular demand has been an input parameter; in the more general model for dsp investigated in this paper, this value is part of the decisions to take. To use the new dsp model algorithmically, we suggest a branch-and-cut approach which employs a column generation procedure to deal with the exponential number of routing variables.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Strategy to Find Solution for Survivable Multicommodity ‎Network‎

This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...

متن کامل

Designing capacitated survivable networks: Polyhedral analysis and algorithms

Designing capacitated survivable networks: Polyhedral analysis and algorithms by Deepak Rajan Doctor of Philosophy in Engineering-Industrial Engineering and Operations Research University of California, Berkeley Professor Alper Atamtürk, Chair In this dissertation, we develop new methodologies and efficient algorithms to solve the capacitated survivable network design problem. Given the graph a...

متن کامل

Availability and Cost Based Evaluation of Demand-wise Shared Protection

In this paper, we investigate the connection availabilities for the new protection scheme Demand-wise Shared Protection (DSP) and describe an appropriate approach for their computation. The exemplary case study on two realistic network scenarios shows that in most cases the availabilities for DSP are comparable with that for 1+1 path protection and better than in case of shared path protection.

متن کامل

Dynamic lightpath provisioning with signal quality guarantees in survivable translucent optical networks.

This paper studies the problem of signal-quality-guaranteed lightpath provisioning in survivable translucent optical networks under dynamic traffic. A new protection scheme, called regeneration-segment protection (RSP), is proposed. Provisioning approaches with shared path protection and shared RSP are presented. Two main signal quality constraints are integrated with the provisioning problem. ...

متن کامل

Developing a New Algorithm for a Utility-based Network Design Problem with Elastic Demand

Developing the infrastructures for preventing non-communicable diseases is one of the most important goals of healthcare context in recent years. In this regard, the number and capacity of preventive healthcare facilities as well as assignment of customers to facilities should be determined for each region. Besides the accessibility, the utility of customers is a determinative factor in partici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005